Hard Problems on Random Graphs

Many graph properties are expressible in first order logic. Whether a graph contains a clique or a dominating set of size k are two examples. For the solution size as its parameter the first one is W[1]-complete and the second one W[2]-complete meaning that both of them are hard problems in the worst-case. If we look at both problem from the aspect of average-case complexity, the picture changes. Clique can be solved in expected FPT time on uniformly distributed graphs of size n, while this is not clear for Dominating Set. We show that it is indeed unlikely that Dominating Set can be solved efficiently on random graphs: If yes, then every first-order expressible graph property can be solved in expected FPT time, too. Furthermore, this remains true when we consider random graphs with an arbitrary constant edge probability. We identify a very simple problem on random matrices that is equally hard to solve on average: Given a square boolean matrix, are there k rows whose logical AND is the zero vector? The related Even Set problem on the other hand turns out to be efficiently solvable on random instances, while it is known to be hard in the worst-case

Control of oxidation and spin state in a single-molecule junction

The oxidation and spin state of a metal–organic molecule determine its chemical reactivity and magnetic properties. Here, we demonstrate the reversible control of the oxidation and spin state in a single Fe porphyrin molecule in the force field of the tip of a scanning tunneling microscope. Within the regimes of half-integer and integer spin state, we can further track the evolution of the magnetocrystalline anisotropy. Our experimental results are corroborated by density functional theory and wave function theory. This combined analysis allows us to draw a complete picture of the molecular states over a large range of intramolecular deformations

The Online Simple Knapsack Problem with Reservation and Removability

In the online simple knapsack problem, a knapsack of unit size 1 is given and an algorithm is tasked to fill it using a set of items that are revealed one after another. Each item must be accepted or rejected at the time they are presented, and these decisions are irrevocable. No prior knowledge about the set and sequence of items is given. The goal is then to maximize the sum of the sizes of all packed items compared to an optimal packing of all items of the sequence. In this paper, we combine two existing variants of the problem that each extend the range of possible actions for a newly presented item by a new option. The first is removability, in which an item that was previously packed into the knapsack may be finally discarded at any point. The second is reservations, which allows the algorithm to delay the decision on accepting or rejecting a new item indefinitely for a proportional fee relative to the size of the given item. If both removability and reservations are permitted, we show that the competitive ratio of the online simple knapsack problem rises depending on the relative reservation costs. As soon as any nonzero fee has to be paid for a reservation, no online algorithm can be better than 1.5-competitive. With rising reservation costs, this competitive ratio increases up to the golden ratio (? ? 1.618) that is reached for relative reservation costs of 1-?5/3 ? 0.254. We provide a matching upper and lower bound for relative reservation costs up to this value. From this point onward, the tight bound by Iwama and Taketomi for the removable knapsack problem is the best possible competitive ratio, not using any reservations

Delaying Decisions and Reservation Costs

We study the Feedback Vertex Set and the Vertex Cover problem in a natural variant of the classical online model that allows for delayed decisions and reservations. Both problems can be characterized by an obstruction set of subgraphs that the online graph needs to avoid. In the case of the Vertex Cover problem, the obstruction set consists of an edge (i.e., the graph of two adjacent vertices), while for the Feedback Vertex Set problem, the obstruction set contains all cycles. In the delayed-decision model, an algorithm needs to maintain a valid partial solution after every request, thus allowing it to postpone decisions until the current partial solution is no longer valid for the current request. The reservation model grants an online algorithm the new and additional option to pay a so-called reservation cost for any given element in order to delay the decision of adding or rejecting it until the end of the instance. For the Feedback Vertex Set problem, we first analyze the variant with only delayed decisions, proving a lower bound of $4$ and an upper bound of $5$ on the competitive ratio. Then we look at the variant with both delayed decisions and reservation. We show that given bounds on the competitive ratio of a problem with delayed decisions impliy lower and upper bounds for the same problem when adding the option of reservations. This observation allows us to give a lower bound of $\min{\{1+3\alpha,4\}}$ and an upper bound of $\min{\{1+5\alpha,5\}}$ for the Feedback Vertex Set problem. Finally, we show that the online Vertex Cover problem, when both delayed decisions and reservations are allowed, is $\min{\{1+2\alpha, 2\}}$-competitive, where $\alpha \in \mathbb{R}_{\geq 0}$ is the reservation cost per reserved vertex.Comment: 14 Pages, submitte

Governance for sustainability of estuarine areas: assessing alternative models using the case of Ria de Aveiro, Portugal

Estuaries are one of the most productive and complex types of ecosystems supporting a wide range of economic activities. Departing from a set of governance problems and emergent goals, such as sustainability or climate change adaptation faced by an estuarine case study area, Ria de Aveiro, in Portugal, this article assesses the adequacy of alternative governance models under the existing water resources legal framework and traditional political culture. It shows that apart from the centrally-based compliance model, all other alternatives require high degrees of institutional reforms. Moreover, although the model based on a dedicated new agency, long preferred by many users of Ria de Aveiro, is the most understandable and focused, it does not assure the pursuance of adaptability or collaboration, which are considered essential for estuary governance. As it relies on collective action and multi-level and multi-agent contexts, estuarine governance may require a new institutional design. Where one begins a process of institutional change, however, is not a simple issue to address and demands a deeper analysis, particularly on the types of required institutional changes, as well as on their impacts on policy and decision-making outcomes over estuarine environments and associated socio-ecological networkspublishe

Receptor for advanced glycation endproducts (RAGE) deficiency protects against MPTP toxicity

Copyright © 2011 Elsevier Inc. All rights reserved.Peer reviewedPublisher PD

Challenges of Global Agriculture in a Climate Change Context by 2050 (AgCLIM50)

This report presents a global integrated assessment of the range of potential economic impacts of climate change and stringent mitigation measures in the agricultural sector. The analysis employs five global multi-region multi-commodity models and covers selected combinations of socioeconomic storylines and climate signals by mid-century. Model inputs are harmonised by using the same projections for population and GDP growth, as well as relative biophysical crop yield changes due to climate change. Model results can differ depending on model characteristics and the specific quantitative implementations of the socioeconomic storylines.JRC.D.4-Economics of Agricultur

Beyond land cover change: Towards a new generation of Land Use Models

Land use models play an important role in exploring future land change dynamics and are instrumental to support the integration of knowledge in land system science. However, only modest progress has been made in achieving these aims due to insufficient model evaluation and limited representation of the underlying socio-ecological processes. We discuss how land use models can better represent multi-scalar dynamics, human agency and demand-supply relations, and how we can achieve learning from model evaluation. By addressing these issues we outline pathways towards a new generation of land use models that allow not only the assessment of future land cover pattern changes, but also stimulate envisioning future land use by society to support debate on sustainability solutions and help design alternative solutions

Cellular IAPs inhibit a cryptic CD95-induced cell death by limiting RIP1 kinase recruitment

cIAPs keep RIP1 from getting to the DISC complex and complex II; when cIAPs are repressed, signaling is modulated by the cFLIP isoform